Iterated variable neighborhood search for the capacitated clustering problem
نویسندگان
چکیده
منابع مشابه
Iterated variable neighborhood search for the capacitated clustering problem
The NP-hard capacitated clustering problem (CCP) is a general model with a number of relevant applications. This paper proposes a highly effective iterated variable neighborhood search (IVNS) algorithm for solving the problem. IVNS combines an extended variable neighborhood descent method and a randomized shake procedure to explore effectively the search space. The computational results obtaine...
متن کاملClustering search algorithm for the capacitated centered clustering problem
The Capacitated Centred Clustering Problem (CCCP) consists in partitioning a set of n points into p disjoint clusters with a known capacity. Each cluster is specified by a centroid. The objective is to minimize the total dissimilarity within each cluster, such that a given capacity limit of the cluster is not exceeded. This paper presents a solution procedure for the CCCP, using the hybrid meta...
متن کاملA Variable Neighborhood Search for the Capacitated Arc Routing Problem with Intermediate Facilities
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants the Capacitated Arc Routing Problem with Intermediate Facilities (CARPIF) and the Capacitated Arc Routing Problem with Intermediate Facilities and Length restrictions (CLARPIF). Routing problems represent one of the most prominent classes of mode...
متن کاملVariable Neighborhood Search for Capacitated Connected Facility Location
The Capacitated Connected Facility Location Problem (CConFL) is an NPhard combinatorial optimization problem which arises in the design of last mile communication networks (fiber-to-the-curb scenarios) [1]. Formally, we are given an undirected, weighted graph G = (V,E), with edge costs ce ≥ 0, ∀e ∈ E. The node set V = {r}∪F ∪T is the disjoint union of the root node r, potential facility locatio...
متن کاملIterated Variable Neighborhood Search for the resource constrained multi-mode multi-project scheduling problem
The resource constrained multi-mode multi-project scheduling problem (RCMMMPSP) is a notoriously difficult combinatorial optimization problem. For a given set of activities, feasible execution mode assignments and execution starting times must be found such that some optimization function, e. g. the makespan, is optimized. When determining an optimal (or at least feasible) assignment of decisio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering Applications of Artificial Intelligence
سال: 2016
ISSN: 0952-1976
DOI: 10.1016/j.engappai.2016.08.004